Algoritmos de análisis para gramáticas de inserción de árboles

Tree Insertion Grammar (TIG) is a compromise between Context Free Grammar (CFG) and Tree Adjoining Grammar (TAG) that can be parsed in O(n3)− time. In the literature, just two parsers for TIGs have been defined, based on the well-known CYK and Earley algorithms for CFGs. In this paper, we define four new parsers for TIGs: three parsers use a bottom-up strategy and the other one uses a predictive bottom-up strategy.